package Atop100;

import java.util.HashMap;

public class Class1 {


    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length ; i++) {
            if (map.containsKey(target-nums[i])){
                return  new int[]{i,map.get(target-nums[i])};
                }
            else {
                map.put(nums[i],i );
            }

        }
        return  null;

    }
}
